Probability timed automata for investigating communication processes

Regular Processes and Timed Automata

In [10], an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We show that regular processes, i.e., processes de ned using nitely many guarded recursive equations, are as expressive as nite timed automata. The proof uses only the axiom system and unfolding of recursive equations. Si...

Game Characterizations of Timed Relations for Timed Automata Processes

In this work, we design the game semantics for timed equivalences and preorders of timed processes. The timed games corresponding to the various timed relations form a hierarchy. These games are similar to Stirling’s bisimulation games. If it is the case that the existence of a winning strategy for the defender in a game G1 implies that there exists a winning strategy for the defender in anothe...

Multi-timed Bisimulation for Distributed Timed Automata

Timed Unfoldings for Networks of Timed Automata

Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here, we design a verification algorithm for networks of timed automata with invariants. Based on the unfolding technique, our method produces a branching process as an acyclic Petri net extended with read arcs. These arc...

Using Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)

A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...